Clique problem - PDFSEARCH.IO - Document Search Engine

Clique problem
Results: 134

#	Item
81	Newsletter of the PC Community November 2011 Welcome Frances Rosamond, Editor Congratulations to Serge Gaspers and Mohammad Taghi Hajiaghayi for multiple awards, to Yoichi Iwata for the IPEC Excellent Student Paper award Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:09:27 NP-complete problems Parameterized complexity Kernelization NP-complete Bidimensionality Dominating set Clique problem Feedback vertex set Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
82	Sparse Long-Range Random Field and its Application to Image Denoising Yunpeng Li and Daniel P. Huttenlocher Department of Computer Science, Cornell University, Ithaca, NY 14853 {yuli,dph}@cs.cornell.edu Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2008-07-27 07:55:12 Bayesian statistics Artificial intelligence Markov random field Theoretical computer science Clique Noise reduction Markov model Clique problem Community structure Graph theory Networks Graphical models
83	Graphs and Circuits: Some Further Remarks ∗ S. Jukna Institute of Mathematics Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2007-10-01 09:10:14 Graph Clique Matching Neighbourhood Clique problem Line graph Graph theory Mathematics Theoretical computer science
84	Single Level Conjecture for Quadratic Functions and Graphs Stasys Jukna Lithuanian Academy of Sciences Vilnius, Lithuania & Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2007-08-30 03:42:33 Circuit complexity Complexity classes AC Clique Circuit Graph theory Clique problem Aanderaa–Karp–Rosenberg conjecture Theoretical computer science Computational complexity theory Applied mathematics
85	Contact Prediction, Routing and Fast Information Spreading in Social Networks by Kazem Jahanbakhsh B.Sc., Sharif University of Technology, 2001 M.Sc., Sharif University of Technology, 2005 A Dissertation Submitted in Par Add to Reading List Source URL: www.kazemjahanbakhsh.com Language: English - Date: 2013-03-29 00:49:15 Network theory Networks Clique Centrality Routing Algorithm Graph Shortest path problem Greedy algorithm Mathematics Graph theory Combinatorics
86	Technical Report TR[removed]June 2010 Computer Vision and Machine Learning Group Institute of Numerical Simulation University of Bonn Add to Reading List Source URL: www.eecs.berkeley.edu Language: English - Date: 2014-06-04 23:25:01 Segmentation Market segmentation Clique problem Tessellation Clique Applied mathematics Marketing Tiling Mathematics Image processing
87	Exact DFA Identification Using SAT Solvers Marijn J.H. Heule1, and Sicco Verwer2 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 07:36:36 Automata theory NP-complete problems Graph coloring Graph theory Boolean satisfiability problem Deterministic finite automaton Clique DFA Records Powerset construction Theoretical computer science Mathematics Applied mathematics
88	To appear in 13th International Conference on Computer Vision, 6-13 November 2011, Barcelona, Spain. Image Segmentation by Figure-Ground Composition into Maximal Cliques Adrian Ion∗, Joao Carreira, Cristian Sminchises Add to Reading List Source URL: www.eecs.berkeley.edu Language: English - Date: 2014-06-04 23:25:00 Applied mathematics Image processing Segmentation Geometry Tessellation Market segmentation Clique problem Clique Independent set Mathematics Tiling NP-complete problems
89	Supplementary Material Image Segmentation by Figure-Ground Composition into Maximal Cliques Adrian Ion University of Bonn Joao Carreira Add to Reading List Source URL: www.eecs.berkeley.edu Language: English - Date: 2014-06-04 23:25:17 Clique problem Segmentation Truth Ground truth Clique Philosophy Ethics Mathematics
90	This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE ICC 2011 proceedings Completion Delay Minimization for Instantly Decodable Networ Add to Reading List Source URL: www.comm.utoronto.ca Language: English - Date: 2011-12-23 16:23:54 NP-complete problems Clique Network coding Shortest path problem Maximal independent set Path decomposition Graph theory Theoretical computer science Mathematics

UPDATE